منابع مشابه
Replica Placement Algorithms with Latency Constraints in Content Distribution Networks
Content distribution networks (CDNs) are a recent development to improve the performance of networked applications. The design of replica placement algorithms is one of the foremost problems in CDNs. Current replica placement methods do not guarantee a bound on the maximum latency to any client. In this paper, we propose several algorithms for replica placement with latency constraints. The alg...
متن کاملTopology-informed Internet replica placement
Recently, several studies have looked into the problem of replicated server placement on the Internet. Some of those studies have demonstrated that there exists a replica placement algorithm that can perform within a factor of 1.1{1.5 of the optimal solution. However, this particular greedy algorithm requires detailed knowledge about network topology, and knowledge about expected client locatio...
متن کاملImprove Replica Placement in Content Distribution Networks with Hybrid Technique
The increased using of the Internet and its accelerated growth leads to reduced network bandwidth and the capacity of servers; therefore, the quality of Internet services is unacceptable for users while the efficient and effective delivery of content on the web has an important role to play in improving performance. Content distribution networks were introduced to address this issue. Replicatin...
متن کاملLexico-Minimum Replica Placement in Multitrees
In this work, we consider the problem of placing replicas in a data center or storage area network, represented as a digraph, so as to lexico-minimize a previously proposed reliability measure which minimizes the impact of all failure events in the model in decreasing order of severity. Prior work focuses on the special case in which the digraph is an arborescence. In this work, we consider the...
متن کاملReplica Placement via Capacitated Vertex Cover
In this paper, we study the replica placement problem on trees and present a constant factor approximation algorithm (with an additional additive constant factor). This improves the best known previous algorithm having an approximation ratio dependent on the maximum degree of the tree. Our techniques also extend to the partial cover version. Our algorithms are based on the LP rounding technique...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IPSJ Digital Courier
سال: 2006
ISSN: 1349-7456
DOI: 10.2197/ipsjdc.2.561